A Partial Order Approach to Branching Time Logic Model Checking

Part.ial order t.echniques enable reducing the size of I.Iw sl,ate gtoaph used for model checking, thus alleviating the 'state space explosion' problem. Tilt'sf.' reductions are based on selecting a subset of the enabled operations from each program 51.ale. So far. these methods have been studied, implemel~ted and demonst.rat.ed fol' assertional langllagcs t.hat. model t.he executions of a program as comi)utat,ion seC]ueilces, in particlilar" t.he logic tTL (Iiilf'a-I' tCllll)Oral"!ogic): The preseiltpaper shows, for the first. time. how t.his approach call he applied to hmguages that. model the behavior of a program as a t.ree. ',Ve st.udy he.re part.ia,l ordel' reciud.iolls ror branching t.emporal logics, e.g., the logics CTL and CTL * (all logics with the next,-t illle operator removed) and process algebra. such as CCS. Condit.ions 011 the subset. of 811CCf;'SSOrs [rom each Ilodp. t.o guarant.ee reduct.ion that, preserves CTL propert.ies are given. Provided experiment.al l'('slIll.:<; show t.hat. t.he reduction is substantial.